Design Index-Based Hedging: Bundled Loss Property and Hybrid Genetic Algorithm

نویسنده

  • Frank Xuyan Wang
چکیده

For index-based hedging design, the scatter plot of the hedging contract losses versus the losses to be hedged is generally used to visualize and quantify basis risk. While studying this scatter plot, which does not cluster along the diagonal as desired, a “bundled loss” phenomenon is found. In a setting where both the hedging and the hedged contracts have 100,000 years of simulated losses, this shows that if we need to hedge one loss in a year for the hedged contract, we may need to pay for other losses in other years in the hedging contract, which are unnecessary and unwanted. The reason is that the index used in the hedging may have identical loss values in different years while the hedged contract may not. This finding is a guiding principle for forming the risk measures and solution frameworks. To solve the problem so formed, a hybrid multiparent and orthogonal crossover genetic algorithm, GA-MPCOX, is used and pertinent adjustments are studied. For a problem with hundreds of dimensions, using eleven parents seems best, while a problem with tens of dimensions would prefer nine parents. Depending on the dimensions, relevant best strategies of the orthogonal crossover are also suggested by experimental results. To combat the stagnation of the algorithm, the perturbation by Lévy stable distribution is studied. This reveals possible effective parameters and forms. Numerical comparison with other algorithms is also conducted that confirms its competence for the hedging problem. Keywords—hedging problem; genetic algorithm; multi-parent crossover; orthogonal crossover; Lévy stable distribution

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monitoring process variability: a hybrid Taguchi loss and multiobjective genetic algorithm approach

The common consideration on economic model is that there is knowledge about the risk of occurrence of an assignable cause and the various cost parameters that does not always adequately describe what happens in practice. Hence, there is a need for more realistic assumptions to be incorporated. In order to reduce cost penalties for not knowing the true values of some parameters, this paper aims ...

متن کامل

A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

متن کامل

Proposing a Novel Cost Sensitive Imbalanced Classification Method based on Hybrid of New Fuzzy Cost Assigning Approaches, Fuzzy Clustering and Evolutionary Algorithms

In this paper, a new hybrid methodology is introduced to design a cost-sensitive fuzzy rule-based classification system. A novel cost metric is proposed based on the combination of three different concepts: Entropy, Gini index and DKM criterion. In order to calculate the effective cost of patterns, a hybrid of fuzzy c-means clustering and particle swarm optimization algorithm is utilized. This ...

متن کامل

A New Hybrid model of Multi-layer Perceptron Artificial Neural Network and Genetic Algorithms in Web Design Management Based on CMS

The size and complexity of websites have grown significantly during recent years. In line with this growth, the need to maintain most of the resources has been intensified. Content Management Systems (CMSs) are software that was presented in accordance with increased demands of users. With the advent of Content Management Systems, factors such as: domains, predesigned module’s development, grap...

متن کامل

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015